divide and conquer algorithms造句

例句与造句

1. In this sense, correlation attacks can be considered divide and conquer algorithms.
2. This method allows direct implementation of functions defined by mathematical induction and recursive divide and conquer algorithms.
3. Thus the distinguished element allows for a decomposition according to a predicate that is a simple form of a divide and conquer algorithm.
4. The correctness of a divide and conquer algorithm is usually proved by mathematical induction, and its computational cost is often determined by solving recurrence relations.
5. Typically, a cache-oblivious algorithm works by a recursive divide and conquer algorithm, where the problem is divided into smaller and smaller subproblems.
6. It's difficult to find divide and conquer algorithms in a sentence. 用divide and conquer algorithms造句挺难的
7. The FWHT h is a divide and conquer algorithm that recursively breaks down a WHT of size N into two smaller WHTs of size N / 2.
8. The Karatsuba algorithm is the earliest known divide and conquer algorithm for multiplication and lives on as a special case of its direct generalization, the Toom Cook algorithm.
9. The divide and conquer algorithm computes the smaller multiplications recursively, using the scalar multiplication " a " 11 " b " 11 } } as its base case.
10. Separator hierarchies may be used to devise efficient divide and conquer algorithms for planar graphs, and dynamic programming on these hierarchies can be used to devise exponential time and systems of linear equations arising from finite element methods.
11. This process is an example of the general technique of divide and conquer algorithms; in many traditional implementations, however, the explicit recursion is avoided, and instead one traverses the computational tree in breadth-first fashion.
12. Beam Stack Search uses the beam stack as a data structure to integrate chronological backtracking with beam search and can be combined with the divide and conquer algorithm technique, resulting in divide-and-conquer beam-stack search.
13. This is a divide and conquer algorithm with run-time of O ( np ), where " n " is the number of polygons and " p " is the number of pixels in the viewport.
14. Since a blockwise inversion of an ?} } matrix requires inversion of two half-sized matrices and 6 multiplications between two half-sized matrices, it can be shown that a divide and conquer algorithm that uses blockwise inversion to invert a matrix runs with the same time complexity as the matrix multiplication algorithm that is used internally.
15. As another example of a divide and conquer algorithm that did not originally involve computers, Donald Knuth gives the method a post office typically uses to route mail : letters are sorted into separate bags for different geographical areas, each of these bags is itself sorted into batches for smaller sub-regions, and so on until they are delivered.
16. Sorting algorithms are prevalent in introductory computer science classes, where the abundance of algorithms for the problem provides a gentle introduction to a variety of core algorithm concepts, such as big O notation, divide and conquer algorithms, data structures such as heaps and binary trees, randomized algorithms, best, worst and average case analysis, time-space tradeoffs, and upper and lower bounds.
更多例句：  下一页